Identity Based Multisignatures

نویسندگان

  • Raju Gangishetti
  • M. Choudary Gorantla
  • Manik Lal Das
  • Ashutosh Saxena
چکیده

This paper presents identity based serial and parallel multisignature schemes using bilinear pairings. Our serial multisignature scheme requires a forced verification at every level to avoid the overlooking of the predecessors’ signatures. However, in parallel multisignature scheme the verification of individual signatures is performed by a designated clerk. We show that our schemes are secure against existential forgery under adaptive chosen message attack in the random oracle model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accountable-Subgroup Multisignatures

Formal models and security proofs are especially important for multisignatures: in contrast to threshold signatures, no precise definitions were ever provided for such schemes, and some proposals were subsequently broken. In this paper, we formalize and implement a variant of multi-signature schemes, Accountable-Subgroup Multisignatures (ASM). In essence, ASM schemes enable any subgroup, S, of ...

متن کامل

Tightly Secure Non-Interactive Multisignatures in the Plain Public Key Model

Multisignature scheme allows a group of signers to generate a compact signature on a common document that certifies they endorsed the message. However, the existing state of the art multisignatures often suffers from the following problems: impractical key setup assumptions, loose security reductions and inefficient signature verification. In this paper, we propose a noninteractive multisignatu...

متن کامل

Efficient Accountable Multisignatures

It is well-known that n-of-n Schnorr multisignatures can be produced in one round of communication by adding ordinary Schnorr signatures. As observed by Boneh, this can be extended from n-of-n to arbitrary monotone functions of the signers by use of a linear secret sharing scheme. However, such signatures have the property that they are signer indistinguishable; that is, any signer set which is...

متن کامل

A New Multisignature Scheme based on Strong Diffie-Hellman Assumption

Digital multisignatures improve security of digital signatures and reduce fraud by collusion. In this paper we first present a new secure signature scheme which is based on a variant of Strong Diffie-Hellman Assumption, called SDH2 assumption. Then, we extend this signature for a new multisignature scheme without interaction between users. Our proposed schemes which work in groups equipped with...

متن کامل

Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational DiffieHellman problem is hard but the Decisional Diffie-Hellman problem is easy). Our constructions are based on the recently proposed GDH signature scheme of Boneh et al. [8]. Due to the instrumental structure o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Informatica, Lith. Acad. Sci.

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2006